Regular matroids without disjoint circuits
نویسندگان
چکیده
A cosimple regular matroid M does not have disjoint circuits if and only ifM ∈ {M(K3,3),M(Kn) (n ≥ 3)}. This extends a former result of Erdös and Pósa on graphs without disjoint circuits.
منابع مشابه
Circuits Through Cocircuits In A Graph With Extensions To Matroids
We show that for any k-connected graph having cocircumference c∗, there is a cycle which intersects every cocycle of size c∗ − k+2 or greater. We use this to show that in a 2connected graph, there is a family of at most c∗ cycles for which each edge of the graph belongs to at least two cycles in the family. This settles a question raised by Oxley. A certain result known for cycles and cocycles ...
متن کاملRDÖS - P ÓSA PROPERTY FOR MATROID CIRCUITS by Jim Geelen and Kasper
The number of disjoint co-circuits in a matroid is bounded by its rank. There are, however, matroids with arbitrarily large rank that do not contain two disjoint co-circuits; consider, for example, M(Kn) and Un,2n. Also the bicircular matroids B(Kn) have arbitrarily large rank and have no 3 disjoint co-circuits. We prove that for each k and n there exists a constant c such that, if M is a matro...
متن کاملCycle Cover Ratio of Regular Matroids
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every element is in at most 3 of the cycles in S. It follows immediately from this that, on average, each element of M is in at most 3 members of the cycle cover S. This improves on a 1989 result of Jamshy and Tarsi who proved t...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملDominating Circuits in Regular Matroids
In 1971, Nash-Williams proved that if G is a simple 2-connected graph on n vertices having minimum degree at least 3 (n+ 2), then any longest cycle C in G is also edge-domininating; that is, each edge of G has at least one end-vertex incident with a vertex of C. We say that a circuit C in a matroid M is dominating if each component of M/C has rank at most one. In this paper, we show that an ana...
متن کامل